Cryptanalysis of the Sidelnikov Cryptosystem
نویسندگان
چکیده
We present a structural attack against the Sidelnikov cryptosystem [8]. The attack creates a private key from a given public key. Its running time is subexponential and is effective if the parameters of the Reed-Muller code allow for efficient sampling of minimum weight codewords. For example, the length 2048, 3rd-order Reed-Muller code as proposed in [8] takes roughly an hour to break on a stock PC using the presented method.
منابع مشابه
Cryptanalysis of the McEliece cryptosystem over hyperelliptic codes
We present a practical expected usually quartic time algorithm to recover the structure of an algebraic geometry code defined over a hyperelliptic code of genus g ≤ 2. Its main application is an attack of the McEliece cryptosystem based on algebraic geometry codes defined over curves of small genus. Our algorithm is a adaptation of the well-known Sidelnikov-Shestakov algorithm [6].
متن کاملQuantum Fourier sampling, Code Equivalence, and the quantum security of the McEliece and Sidelnikov cryptosystems
The Code Equivalence problem is that of determining whether two given linear codes are equivalent to each other up to a permutation of the coordinates. This problem has a direct reduction to a nonabelian hidden subgroup problem (HSP), suggesting a possible quantum algorithm analogous to Shor’s algorithms for factoring or discrete log. However, in Dinh et al. [2011] we showed that in many cases ...
متن کاملCAES Cryptosystem: Advanced Security Tests and Results
A robust and secure cryptosystem is an encrypting system that resists against all practical cryptanalysis methods such as statistical attacks, differential cryptanalysis and linear cryptanalysis. To prove the resistance against these attacks, the cryptosystem designer must carry out a list of robustness tests. Considering these constraints, we present in the current paper results of robustness ...
متن کاملAn efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملReview on Chaotic Sequences Based Cryptography and Cryptanalysis
This literature review glances at the research that has been published in the area of chaos cryptography along with cryptanalysis of chaotic cryptosystem. It compares and contrasts the work done in different research papers towards the designing and cryptanalysis of chaotic cryptosystem for the validity of cryptosystems and improvement in encryption techniques. This review analyzes the role tha...
متن کامل